A fast algorithm and datalog inexpressibility for temporal reasoning
نویسندگان
چکیده
منابع مشابه
Stream Reasoning in Temporal Datalog
In recent years, there has been an increasing interest in extending traditional stream processing engines with logical, rule-based, reasoning capabilities. This poses significant theoretical and practical challenges since rules can derive new information and propagate it both towards past and future time points; as a result, streamed query answers can depend on data that has not yet been receiv...
متن کاملA Fast Algorithm and Lower Bound for Temporal Reasoning
We introduce two new tractable temporal constraint languages, which both strictly contain the Ord-Horn language of Bürkert and Nebel. The algorithm we present for these languages decides whether a given set of constraints is consistent in time that is quadratic in the input size. We also prove that (unlike Ord-Horn) the two languages cannot be solved by Datalog or by establishing local consiste...
متن کاملDatalog LITE : Temporal versus deductive reasoning
In this paper we show that Datalog is well-suited as a temporal veriication language. Datalog is a well-known database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with negation, and present a linear time model checking algorithm for Datalog LITE. We show that Datalog LITE subsumes temporal languages such as CTL and the alternation-f...
متن کاملDatalog as a Lingua Franca for Provenance Querying and Reasoning
The Open Provenance Model (OPM) [20] provides a small, extensible core for representing and exchanging provenance information in a technology-neutral manner. By design, OPM is a least common denominator, leaving aside certain aspects, including how to query provenance information. Similarly, OPM comes with a set of inference rules (e.g., for transitively closing some relations, or for stating t...
متن کاملThe Datalog Approach For Reasoning Over Ontologies
Ontologies is not just a buzz word, rather, the reality requires Ontologies to be a huge repository to perform metadata storage and management in the Semantic Web context. The belief proposed in this paper states that it is an essential way to develop a rule-based inference engine on the top of Ontologies to improve the performance of an Ontology as a semantic database system. Then the necessit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2010
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1740582.1740583